Discovery of High-Dimensional Inclusion Dependencies∗
نویسندگان
چکیده
Determining relationships such as functional or inclusion dependencies within and across databases is important for many applications in information integration. When such information is not available as explicit meta data, it is possible to discover potential dependencies from the source database extents. However, the complexity of such discovery problems is typically exponential in the number of at-
منابع مشابه
Discover Dependencies from Data - A Review
Functional and inclusion dependency discovery is important to knowledge discovery, database semantics analysis, database design, and data quality assessment. Motivated by the importance of dependency discovery, this paper reviews the methods for functional dependency, conditional functional dependency, approximate functional dependency and inclusion dependency discovery in relational databases ...
متن کاملScaling Out the Discovery of Inclusion Dependencies
Inclusion dependencies are among the most important database dependencies. In addition to their most prominent application – foreign key discovery – inclusion dependencies are an important input to data integration, query optimization, and schema redesign. With their discovery being a recurring data profiling task, previous research has proposed different algorithms to discover all inclusion de...
متن کاملAutomatic Discovery of Functional Dependencies and Conditional Functional Dependencies: A Comparative Study
Over the last twenty years, several algorithms have been proposed for automatic rule/constraint discovery from data, for the purpose of data cleaning. These algorithms look for constraints such as functional dependencies (FDs), conditional FDs (CFDs), inclusion dependencies (INDs), conditional INDs (CINDs), association rules, integrity constraints (ICs) and denial constraints (DCs), among other...
متن کاملCan high-order dependencies improve mutual information based feature selection?
Mutual information (MI) based approaches are a popular paradigm for feature selection. Most previous methods have made use of low-dimensional MI quantities that are only effective at detecting low-order dependencies between variables. Several works have considered the use of higher dimensional mutual information, but the theoretical underpinning of these approaches is not yet comprehensive. To ...
متن کاملThe Parameterized Complexity of Dependency Detection in Relational Databases
We study the parameterized complexity of classical problems that arise in the profiling of relational data. Namely, we characterize the complexity of detecting unique column combinations (candidate keys), functional dependencies, and inclusion dependencies with the solution size as parameter. While the discovery of uniques and functional dependencies, respectively, turns out to be W [2]-complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002